minimum delay造句
例句与造句
- Minimum delay programming
最短延迟规划 - A standard procedure ensured that orders were relayed with minimum delay to all sub - units in the division
一种标准的程序保证各种命令可在最短的时间内下达到师属各部门。 - By providing the information specified in the form you will assist the party concerned to process your request with minimum delay
你在表格上清楚填妥资料，将有助有关方面尽快处理你的查阅资料要求。 - The hkma s practice is to process applications for consent with the minimum delay , subject to the necessary procedures having been followed
金管局的一贯做法是按照既定的程序尽快处理这些委任申请。 - By providing the information specified in the form you will assist the party concerned to process your request with minimum delay
你在表格上清楚填妥资料，将有助有关方面尽快处理你的查阅资料要求。 - It's difficult to find minimum delay in a sentence. 用minimum delay造句挺难的
- It is very tempting to concentrate all testing efforts on the nl - enabled version of the product in order to get it shipped with the minimum delay
为了以最短的延期时间交付产品支持本地语言的版本，测试人员很有可能将所有的测试工作都集中在该版本上。 - Another constrained problem is delay and delay variation constrained multicast routing problem . sp - dvma ( shortest path delay variation multicast algorithm ) algorithm based on minimum delay path is presented
第二类是时延和时延差约束的多播路由问题，提出了以最短时延路径为基础的一种算法? ? sp - dvma算法。 - One of constrained problem is delay constrained steiner tree problem . a heuristic dbma ( delay - bounded multicast routing algorithm ) based on minimum delay path set and minimum cost path set is proposed . simulation result demonstrate that it is a delay constrained algorithm with low time complexity and low cost
首先是时延约束的最小steiner树问题，在比较了现有的算法以后，提出了一种基于最短时延路径集和最小费用路径集的多播路由算法? ? dbma算法，仿真结果表明该算法是一种低复杂度的时延约束低费用多播路由算法。 - The delay and delay variation constrained minimum steiner tree problem is also researched . lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem . low time complexity , low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths
对于时延和时延差约束的最小steiner树问题，提出了一种基于最小时延路径和最小费用路径的算法?一lcdvma算法，由于该算法比较了通过中转节点后的最低费用路径和最短时延路径，降低了运算复杂度，通过仿真得到了较小的网络费用和时延差，因此lcdvma算法是一种具有低复杂度的时延和时延差约束的最小steiner树的启发式算法。